Key Agreement from Close Secrets over Unsecured Channels
نویسندگان
چکیده
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also known as information reconciliation and privacy amplification over unsecured channels, was shown to be theoretically feasible by Renner and Wolf (Eurocrypt 2004), although no protocol that runs in polynomial time was described. We propose a protocol that is not only polynomial-time, but actually practical, requiring only a few seconds on consumer-grade computers. Our protocol can be seen as an interactive version of robust fuzzy extractors (Boyen et al., Eurocrypt 2005, Dodis et al., Crypto 2006). While robust fuzzy extractors, due to their noninteractive nature, require w to have entropy at least half its length, we have no such constraint. In fact, unlike in prior solutions, in our solution the entropy loss is essentially unrelated to the length or the entropy of w, and depends only on the security parameter.
منابع مشابه
Logic of secrets in collaboration networks
The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system’s key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the ...
متن کاملCritical Discourse Analysis of the Political Novel, “Unsecured Existence”
Political novel is one of the kinds of Persian Literature with special factors, which are different from other contemporary story writing styles. These types of stories are more accommodated with critical discourse analysis (CDA) among other methods of novel analyses compared to other types, because of their specificity and unique quality of and their close relations with society and political...
متن کاملError Correction for a Secure Multicast Group Key Management using Gray Code
Key agreement protocols are designed to provide two or more specified parties communicating over public channels with a common shared secret key, which may subsequently be used to exchange information among communicating parties. Therefore, building secure key agreement protocols over open networks is essential in information security. Error Correcting Codes (ECC) is one of many tools made avai...
متن کاملFuzzy Authenticated Key Exchange
Consider key agreement by two parties who start out knowing a common secret (which we refer to as “pass-string”, a generalization of “password”), but face two complications: (1) the pass-string may come from a low-entropy distribution, and (2) the two parties’ copies of the pass-string may have some noise, and thus not match exactly. We provide the first efficient and general solutions to this ...
متن کاملAdaptive Weak Secrets for Authenticated Key Exchange*
This paper describes biometric-based cryptographic techniques that use weak secrets to provide strong, multi-factor and mutual authentication, and establish secure channels for subsequent communications. These techniques rely on lightweight cryptographic algorithms for confidential information exchange. Lightweight algorithms are suitable for use in resource constrained environments such as the...
متن کامل